Note on Cellular Structure of Edge Colored Partition Algebras

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the structure of lie derivations on c*-algebras

نشان می دهیم که هر اشتقاق لی روی یک c^*-جبر به شکل استاندارد است، یعنی می تواند به طور یکتا به مجموع یک اشتقاق لی و یک اثر مرکز مقدار تجزیه شود. کلمات کلیدی: اشتقاق، اشتقاق لی، c^*-جبر.

15 صفحه اول

Representations of Vertex Colored Partition Algebras

The G-vertex colored partition algebras Pk(x, G) and extended G-vertex colored partition algebras b Pk(x, G) have been recently defined in [16] and [17] respectively and they have been realized as the centralizer algebras of the groups Sn × G and Sn respectively, under the action on W ⊗k, where W = Cn|G| and C is the field of complex numbers. In this paper, we use the representation theory of t...

متن کامل

A Note on Covering Edge Colored Hypergraphs by Monochromatic Components

For r ≥ 2, α ≥ r − 1 and k ≥ 1, let c(r, α, k) be the smallest integer c such that the vertex set of any non-trivial r-uniform k-edge-colored hypergraph H with α(H) = α can be covered by c monochromatic connected components. Here α(H) is the maximum cardinality of a subset A of vertices in H such that A does not contain any edges. An old conjecture of Ryser is equivalent to c(2, α, k) = α(r − 1...

متن کامل

Note on the structure of constraint algebras

It is shown that when the gauge algebra is with root system the canonical Hamiltonian commutes with the constraints. Two other simple propositions concerning gauge fixing are proved too.

متن کامل

Note on edge-colored graphs and digraphs without properly colored cycles

We study the following two functions: d(n, c) and ~ d(n, c); d(n, c) (~ d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and minimum monochromatic degree (out-degree) at least k has a properly colored cycle. Abouelaoualim et al. (2007) stated a conjecture which implies that d(n, c) = 1. Using a recursive construction of c-edge-colored graphs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kyungpook mathematical journal

سال: 2016

ISSN: 1225-6951

DOI: 10.5666/kmj.2016.56.3.669